An Optimal Sequential Algorithm to Compute All Hinge Vertices on Circular-Arc Graphs
نویسنده
چکیده
The distance between at least two vertices of a network becomes longer after the removal of a hinge vertex. Thus a faulty hinge vertex will increase the overall communication cost in a network. Therefore, finding the set of all hinge vertices in a graph can be used to identify the critical nodes in a real network. In this paper, an algorithm is presented to find hinge vertices of a circular-arc graph. If the circular arc representation is given, then the proposed algorithm runs in O(n) time, where n is the number of vertices of the circulararc graph. AMS Mathematics Subject Classification: 05C85, 68R10, 68W05, 05C15.
منابع مشابه
Some Optimal Parallel Algorithms for Shortest Path Related Problems on Interval and Circular-arc Graphs
In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our preprocessing algorithms run in O(log n) t...
متن کاملSome Optimal Parallel Algorithms on Interval and Circular-arc Graphs
In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our preprocessing algorithms run in O(log n) t...
متن کاملA Sequential Algorithm to Solve Next-to-Shortest Path Problem on Circular-arc Graphs
In this article, we study the problem of finding the next-to-shortest path in circular-arc graph. A next-to-shortest path between any pair of vertices in a shortest path amongst all paths between those vertices with length strictly greater than the length of the shortest path. The next-to-shortest path problem in a directed graph in NP-hard. Here we deigned a polynomial time algorithm to solve ...
متن کاملComputing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in Ioannidou et al. (2011) [19] with running ti...
متن کاملComputing and Counting the Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in [20] with running time O(n) on a graph with ...
متن کامل